<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>My Project: my_tree.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">My Project
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
  initMenu('',true,false,'search.php','Search',true);
  $(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(function(){initNavTree('my__tree_8h_source.html','',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>

<div class="header">
  <div class="headertitle"><div class="title">my_tree.h</div></div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include&lt;iostream&gt;</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include&lt;utility&gt;</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include&lt;vector&gt;</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include&lt;list&gt;</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include&lt;stack&gt;</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include&lt;queue&gt;</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include&lt;algorithm&gt;</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include&lt;string&gt;</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include&lt;functional&gt;</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include&lt;cassert&gt;</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include&lt;cstdlib&gt;</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include&lt;cmath&gt;</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#define MAX_LEN 100;</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keyword">using namespace </span>std;</div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keyword">struct </span><a class="code hl_struct" href="struct_tree_node.html">TreeNode</a>;</div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">class </span><a class="code hl_class" href="classmy__tree.html">my_tree</a>;</div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>ostream&amp; <a class="code hl_friend" href="classmy__tree.html#aa1da950e13ff2a3c6fcaca11015a4e20">operator&lt;&lt;</a>(ostream&amp; os,<a class="code hl_class" href="classmy__tree.html">my_tree&lt;T&gt;</a> Tree);</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment">//-----------------------------------------定义工具函数----------------------------------------</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keywordtype">void</span> print(<span class="keywordtype">int</span> x){</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    cout&lt;&lt;x&lt;&lt;<span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="classmy__tree.html#a9aa06543930fa8ddb21c1ebabbff3ecf">   35</a></span><span class="keywordtype">void</span> <a class="code hl_friend" href="classmy__tree.html#a9aa06543930fa8ddb21c1ebabbff3ecf">print_node</a>(<a class="code hl_function" href="classmy__tree.html#a9c79fe45a5aae4cbb2efbc5bb050a135">my_tree&lt;T&gt;</a> Tree,<span class="keywordtype">int</span> x){</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">if</span>(x&lt;Tree.v.size()){</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        cout&lt;&lt;Tree.v[x];</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    } </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>}</div>
</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment">//-----------------------------------------定义主类----------------------------------------</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00050" data-start="{" data-end="};">
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="struct_tree_node.html">   50</a></span><span class="keyword">struct </span><a class="code hl_function" href="struct_tree_node.html#a04c315e7d9af382fa471a9d3858e8c72">TreeNode</a> {</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    T data;               <span class="comment">// 节点数据</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">int</span> parent;           <span class="comment">// 双亲索引（-1表示无双亲，即根节点）</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordtype">int</span> first_child;       <span class="comment">// 第一个孩子的索引（-1表示无孩子）</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">int</span> next_sibling;      <span class="comment">// 下一个兄弟节点的索引（-1表示无下一个兄弟）</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span></div>
<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="struct_tree_node.html#a04c315e7d9af382fa471a9d3858e8c72">   64</a></span>    <a class="code hl_function" href="struct_tree_node.html#a04c315e7d9af382fa471a9d3858e8c72">TreeNode</a>(T d = T(), <span class="keywordtype">int</span> p = -1, <span class="keywordtype">int</span> fc = -1, <span class="keywordtype">int</span> ns = -1)</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        : data(d), parent(p), first_child(fc), next_sibling(ns) {}</div>
</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>};</div>
</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00077" data-start="{" data-end="};">
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="classmy__tree.html">   77</a></span><span class="keyword">class </span><a class="code hl_function" href="classmy__tree.html#a9c79fe45a5aae4cbb2efbc5bb050a135">my_tree</a>{</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keyword">private</span>:</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        vector&lt;TreeNode&lt;T&gt;&gt; v;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keyword">public</span>:</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="comment">//----------------------------------------构造操作-----------------------------------------</span></div>
<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="classmy__tree.html#a9c79fe45a5aae4cbb2efbc5bb050a135">   87</a></span>        <a class="code hl_function" href="classmy__tree.html#a9c79fe45a5aae4cbb2efbc5bb050a135">my_tree</a>(T val=0){</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            <a class="code hl_struct" href="struct_tree_node.html">TreeNode&lt;T&gt;</a> p(val);</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            v.push_back(p);</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        }</div>
</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="comment">//----------------------------------------查询操作-----------------------------------------</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">get_root</a>();     </div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(vector&lt;int&gt;&amp; children,<span class="keywordtype">int</span> root);     </div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(queue&lt;int&gt;&amp; children,<span class="keywordtype">int</span> root);     </div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a6d1fb6a1cb4a9064cb2538d1fbaa8b06">get_height</a>(<span class="keywordtype">int</span> index);     </div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a6d1fb6a1cb4a9064cb2538d1fbaa8b06">get_height</a>();     </div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a2cef5c6b97d67ca6a49b0577600f5254">get_h_layer_nodes</a>(<span class="keywordtype">int</span> h);     </div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a3b2c0f604e05f25ffd37a6d0f45a2a26">get_last_layer_nodes</a>();</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a826f12f2e9f55f7436fa8d3e1d41da93">get_nodes_nums</a>();                  </div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        T <a class="code hl_function" href="classmy__tree.html#afbfe59f624cf7f8a7f8ebb3cc9ad4514">get_value</a>();       </div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">show_k_node</a>(<span class="keywordtype">int</span> k);</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="comment">//----------------------------------------增删操作-----------------------------------------</span></div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a0d6043fc3e177a775f837fc9dfaea31a">insert</a>(<a class="code hl_struct" href="struct_tree_node.html">TreeNode&lt;T&gt;</a> node);</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <span class="comment">//----------------------------------------遍历操作-----------------------------------------</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a49e765fa53962f4ce7d11d6cdb8a12ad">show_binary_tree_with_root</a>(<span class="keywordtype">string</span> mode,<span class="keywordtype">int</span> root);</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a0020d5a85f5d99734466c6ef5d255b72">show_binary_tree</a>(<span class="keywordtype">string</span> mode);     </div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Function&gt;</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#aadec19d1d256df1f27412e80bd6579d1">traversal_binary_tree_with_root</a>(<span class="keywordtype">string</span> mode,<span class="keywordtype">int</span> root,Function F);</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Function&gt;</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a99d1637e88625af9f06b6d020730f634">traversal_binary_tree</a>(<span class="keywordtype">string</span> mode,Function F);        </div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        </div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        <span class="comment">//----------------------------------------操作符重载-----------------------------------------</span></div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <span class="keyword">friend</span> ostream&amp; operator&lt;&lt;&lt;&gt;(ostream&amp; os,<a class="code hl_class" href="classmy__tree.html">my_tree&lt;T&gt;</a> Tree);</div>
<div class="foldopen" id="foldopen00198" data-start="{" data-end="}">
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"><a class="line" href="classmy__tree.html#a908b1d95027e3afb39e7e33b59de10b9">  198</a></span>        T <a class="code hl_function" href="classmy__tree.html#a908b1d95027e3afb39e7e33b59de10b9">operator[]</a>(<span class="keywordtype">int</span> index){</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>            <span class="keywordflow">if</span>(index&lt;v.size()){</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>                <span class="keywordflow">return</span> v[index].data;           </div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>            }</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>            <span class="keywordflow">else</span>{</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>                <span class="keywordflow">return</span> v[0].data;</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>            }</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        }</div>
</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span></div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>        <span class="keyword">friend</span> <span class="keywordtype">void</span> <a class="code hl_friend" href="classmy__tree.html#a9aa06543930fa8ddb21c1ebabbff3ecf">print_node&lt;&gt;</a>(<a class="code hl_class" href="classmy__tree.html">my_tree&lt;T&gt;</a> Tree,<span class="keywordtype">int</span> x);</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>};</div>
</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span> </div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span> </div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span> </div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span> </div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span> </div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span> </div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00224" data-start="{" data-end="}">
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">  224</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">my_tree&lt;T&gt;::get_root</a>() {</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;v.size();i++){</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        <span class="keywordflow">if</span>(v[i].parent==-1){</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>            <span class="keywordflow">return</span> i;</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        }</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    }</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>}</div>
</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span> </div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00234" data-start="{" data-end="}">
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"><a class="line" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">  234</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">my_tree&lt;T&gt;::get_children</a>(vector&lt;int&gt;&amp; children,<span class="keywordtype">int</span> root) {</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    <span class="keywordtype">int</span> index=root;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    <span class="keywordflow">if</span>(v[index].first_child!=-1){</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        index=v[index].first_child;     </div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        children.push_back(index);</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    }</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <span class="keywordflow">if</span>(v[index].next_sibling!=-1){</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>        <span class="keywordflow">while</span>(v[index].next_sibling!=-1){</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>            index=v[index].next_sibling;</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>            children.push_back(index);</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>        }           </div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    }</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    return ;</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>}</div>
</div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> </div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00250" data-start="{" data-end="}">
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"><a class="line" href="classmy__tree.html#a225822fd474ed642ee22901b918bd759">  250</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">my_tree&lt;T&gt;::get_children</a>(queue&lt;int&gt;&amp; children,<span class="keywordtype">int</span> root) {</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="keywordtype">int</span> index=root;</div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    <span class="keywordflow">if</span>(v[index].first_child!=-1){</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>        index=v[index].first_child;     </div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        children.push(index);</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    }</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    <span class="keywordflow">if</span>(v[index].next_sibling!=-1){</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        <span class="keywordflow">while</span>(v[index].next_sibling!=-1){</div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>            index=v[index].next_sibling;</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>            children.push(index);</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        }           </div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    }</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    return ;</div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>}</div>
</div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span> </div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00266" data-start="{" data-end="}">
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"><a class="line" href="classmy__tree.html#a532dfbc3d3835014944957a61b7a8bce">  266</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a6d1fb6a1cb4a9064cb2538d1fbaa8b06">my_tree&lt;T&gt;::get_height</a>(<span class="keywordtype">int</span> index){</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    <span class="keywordtype">int</span> height=0;</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    <span class="keywordflow">if</span>(v[index].first_child==-1){</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>        <span class="keywordflow">return</span> 1+height;</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    }</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    vector&lt;int&gt; children;</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,index);</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> it:children){</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>        height=max(height,<a class="code hl_function" href="classmy__tree.html#a532dfbc3d3835014944957a61b7a8bce">get_height</a>(it));</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    }</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <span class="keywordflow">return</span> 1+height;</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>}</div>
</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span> </div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00280" data-start="{" data-end="}">
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"><a class="line" href="classmy__tree.html#a6d1fb6a1cb4a9064cb2538d1fbaa8b06">  280</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a6d1fb6a1cb4a9064cb2538d1fbaa8b06">my_tree&lt;T&gt;::get_height</a>(){</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="classmy__tree.html#a532dfbc3d3835014944957a61b7a8bce">get_height</a>(0);</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>}</div>
</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span> </div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span> </div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00286" data-start="{" data-end="}">
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"><a class="line" href="classmy__tree.html#a2cef5c6b97d67ca6a49b0577600f5254">  286</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a2cef5c6b97d67ca6a49b0577600f5254">my_tree&lt;T&gt;::get_h_layer_nodes</a>(<span class="keywordtype">int</span> h){</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    <span class="keywordflow">if</span>(h&gt;<a class="code hl_function" href="classmy__tree.html#a532dfbc3d3835014944957a61b7a8bce">get_height</a>()){</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    }</div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    <span class="keywordflow">if</span>(h==1){</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>        <span class="keywordflow">return</span> 1;</div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    }</div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    <span class="keywordflow">else</span>{</div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>        vector&lt;int&gt; layer1;</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>        vector&lt;int&gt; layer2;</div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        <span class="keywordtype">int</span> level=1;</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>        <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(layer1,0);</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        level++; </div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>        <span class="keywordflow">while</span>(1){</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>            <span class="comment">//level代表当前所在层</span></div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>            <span class="comment">//也就是正要放节点的那一层</span></div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>            <span class="comment">//实际上，奇数层放在了layer2，偶数层放在了layer1  </span></div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>            <span class="comment">// level已经是2了，如果h是2，这时候就应该返回layer1中的 </span></div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>            <span class="keywordflow">if</span>(level%2==0){</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>                layer2.clear();</div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>                <span class="keywordflow">for</span>(<span class="keyword">auto</span> it:layer1){</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>                    vector&lt;int&gt; children;</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>                    <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,it);</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>                    layer2.insert(layer2.end(), children.begin(), children.end());</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>                }           </div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>                <span class="keywordflow">if</span>(level==h){</div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>                    <span class="keywordflow">return</span> layer1.size();</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>                }</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>                level++;</div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>            }</div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>            <span class="keywordflow">else</span>{</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>                layer1.clear();</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>                <span class="keywordflow">for</span>(<span class="keyword">auto</span> it:layer2){</div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>                    vector&lt;int&gt; children;</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>                    <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,it);</div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>                    layer1.insert(layer1.end(), children.begin(), children.end());</div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>                }</div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>                <span class="keywordflow">if</span>(level==h){</div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>                    <span class="keywordflow">return</span> layer2.size();</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>                }</div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>                level++;</div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>            }</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>        }</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    }</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>}</div>
</div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span> </div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00334" data-start="{" data-end="}">
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"><a class="line" href="classmy__tree.html#a3b2c0f604e05f25ffd37a6d0f45a2a26">  334</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a3b2c0f604e05f25ffd37a6d0f45a2a26">my_tree&lt;T&gt;::get_last_layer_nodes</a>(){</div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    <span class="keywordtype">int</span> height=<a class="code hl_function" href="classmy__tree.html#a532dfbc3d3835014944957a61b7a8bce">get_height</a>();</div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="classmy__tree.html#a2cef5c6b97d67ca6a49b0577600f5254">get_h_layer_nodes</a>(height);</div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>}</div>
</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00340" data-start="{" data-end="}">
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"><a class="line" href="classmy__tree.html#a826f12f2e9f55f7436fa8d3e1d41da93">  340</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__tree.html#a826f12f2e9f55f7436fa8d3e1d41da93">my_tree&lt;T&gt;::get_nodes_nums</a>(){</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    <span class="keywordflow">return</span> this-&gt;v.size();</div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>}</div>
</div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span> </div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00345" data-start="{" data-end="}">
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"><a class="line" href="classmy__tree.html#afbfe59f624cf7f8a7f8ebb3cc9ad4514">  345</a></span>T <a class="code hl_function" href="classmy__tree.html#afbfe59f624cf7f8a7f8ebb3cc9ad4514">my_tree&lt;T&gt;::get_value</a>(){</div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>    assert((v.size()!=0)&amp;&amp;(<span class="stringliteral">&quot;illegal:Tree has no root!&quot;</span>));</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>    cout&lt;&lt;v[0].data&lt;&lt;endl;</div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>    <span class="keywordflow">return</span> v[0].data;</div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>}</div>
</div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>        </div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00352" data-start="{" data-end="}">
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"><a class="line" href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">  352</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">my_tree&lt;T&gt;::show_k_node</a>(<span class="keywordtype">int</span> k) {</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>    cout&lt;&lt;v[k];</div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>}</div>
</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00357" data-start="{" data-end="}">
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"><a class="line" href="classmy__tree.html#a0d6043fc3e177a775f837fc9dfaea31a">  357</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a0d6043fc3e177a775f837fc9dfaea31a">my_tree&lt;T&gt;::insert</a>(<a class="code hl_struct" href="struct_tree_node.html">TreeNode&lt;T&gt;</a> node){</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>    <span class="keywordflow">if</span>(node.parent&lt;v.size()){</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>        <span class="keywordtype">int</span> index=node.parent;</div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>        <span class="keywordflow">if</span>((v[node.parent].first_child==-1)){</div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>            v[node.parent].first_child=v.size();</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>        }</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>        <span class="keywordflow">else</span>{</div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>            index=v[index].first_child; </div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>            <span class="keywordflow">while</span>(1){</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>                <span class="keywordflow">if</span>(v[index].next_sibling==-1){</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>                    v[index].next_sibling=v.size(); </div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>                    <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>                }</div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>                index=v[index].next_sibling;</div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>            }</div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>        }</div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    }</div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    v.push_back(node); </div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>} </div>
</div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span> </div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00378" data-start="{" data-end="}">
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"><a class="line" href="classmy__tree.html#a49e765fa53962f4ce7d11d6cdb8a12ad">  378</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a49e765fa53962f4ce7d11d6cdb8a12ad">my_tree&lt;T&gt;::show_binary_tree_with_root</a>(<span class="keywordtype">string</span> mode,<span class="keywordtype">int</span> root) {</div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;first_root&quot;</span>){</div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>        <a class="code hl_function" href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">show_k_node</a>(root); </div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>        <span class="keywordflow">if</span>(v[root].first_child==-1){</div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>        }</div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>        vector&lt;int&gt; children;</div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>        <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,root);</div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        <span class="keywordflow">for</span>(<span class="keyword">auto</span> it:children){</div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>            <a class="code hl_function" href="classmy__tree.html#a49e765fa53962f4ce7d11d6cdb8a12ad">show_binary_tree_with_root</a>(mode,it);      </div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        }       </div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    } </div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;last_root&quot;</span>){</div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>        <span class="keywordflow">if</span>(v[root].first_child==-1){</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>            <a class="code hl_function" href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">show_k_node</a>(root); </div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>        }</div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>        vector&lt;int&gt; children;</div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>        <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,root);</div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>        <span class="keywordflow">for</span>(<span class="keyword">auto</span> it:children){</div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>            <a class="code hl_function" href="classmy__tree.html#a49e765fa53962f4ce7d11d6cdb8a12ad">show_binary_tree_with_root</a>(mode,it);      </div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>        }</div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>        <a class="code hl_function" href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">show_k_node</a>(root); </div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>    } </div>
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;layer_first&quot;</span>){</div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>        <span class="keywordtype">int</span> index=root;</div>
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>        <a class="code hl_function" href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">show_k_node</a>(root); </div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>        <span class="keywordflow">if</span>(v[root].first_child==-1){</div>
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>        }</div>
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>        queue&lt;int&gt; children;</div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>        <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,root);</div>
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>        </div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>        <span class="keywordflow">while</span>(1){</div>
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>            <span class="keywordflow">if</span>(children.size()==0){</div>
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>                <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>            }</div>
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>            <span class="keywordflow">if</span>(v[children.front()].first_child!=-1){</div>
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>                <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,children.front());</div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>            }</div>
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>            <a class="code hl_function" href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">show_k_node</a>(children.front()); </div>
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>            children.pop();</div>
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>        }</div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>        return ;</div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>    } </div>
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>}</div>
</div>
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span> </div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00426" data-start="{" data-end="}">
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"><a class="line" href="classmy__tree.html#a0020d5a85f5d99734466c6ef5d255b72">  426</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a0020d5a85f5d99734466c6ef5d255b72">my_tree&lt;T&gt;::show_binary_tree</a>(<span class="keywordtype">string</span> mode) {</div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;first_root&quot;</span>){</div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>        <span class="keywordtype">int</span> root=<a class="code hl_function" href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">get_root</a>();</div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>        <a class="code hl_function" href="classmy__tree.html#a49e765fa53962f4ce7d11d6cdb8a12ad">show_binary_tree_with_root</a>(mode,root);</div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>        return ;</div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>    } </div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;last_root&quot;</span>){</div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>        <span class="keywordtype">int</span> root=<a class="code hl_function" href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">get_root</a>();</div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>        <a class="code hl_function" href="classmy__tree.html#a49e765fa53962f4ce7d11d6cdb8a12ad">show_binary_tree_with_root</a>(mode,root);        </div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>        return ;</div>
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    } </div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;layer_first&quot;</span>){</div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>        <span class="keywordtype">int</span> root=<a class="code hl_function" href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">get_root</a>();</div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>        <a class="code hl_function" href="classmy__tree.html#a49e765fa53962f4ce7d11d6cdb8a12ad">show_binary_tree_with_root</a>(mode,root);</div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>        return ;</div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>    } </div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>}</div>
</div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span> </div>
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> Function&gt;</div>
<div class="foldopen" id="foldopen00446" data-start="{" data-end="}">
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"><a class="line" href="classmy__tree.html#aadec19d1d256df1f27412e80bd6579d1">  446</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#aadec19d1d256df1f27412e80bd6579d1">my_tree&lt;T&gt;::traversal_binary_tree_with_root</a>(<span class="keywordtype">string</span> mode,<span class="keywordtype">int</span> root,Function F){   </div>
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;first_root&quot;</span>){</div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>        F(root); </div>
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>        <span class="keywordflow">if</span>(v[root].first_child==-1){</div>
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>        }</div>
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>        vector&lt;int&gt; children;</div>
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>        <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,root);</div>
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>        <span class="keywordflow">for</span>(<span class="keyword">auto</span> it:children){</div>
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>            <a class="code hl_function" href="classmy__tree.html#aadec19d1d256df1f27412e80bd6579d1">traversal_binary_tree_with_root</a>(mode,it,F);      </div>
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>        }       </div>
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>    } </div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;last_root&quot;</span>){</div>
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>        <span class="keywordflow">if</span>(v[root].first_child==-1){</div>
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>            <a class="code hl_function" href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">show_k_node</a>(root); </div>
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>        }</div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>        vector&lt;int&gt; children;</div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>        <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,root);</div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>        <span class="keywordflow">for</span>(<span class="keyword">auto</span> it:children){</div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>            <a class="code hl_function" href="classmy__tree.html#aadec19d1d256df1f27412e80bd6579d1">traversal_binary_tree_with_root</a>(mode,it,F);      </div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>        }</div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>        F(root); </div>
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>    } </div>
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;layer_first&quot;</span>){</div>
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>        <span class="keywordtype">int</span> index=root;</div>
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>        F(root); </div>
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>        <span class="keywordflow">if</span>(v[root].first_child==-1){</div>
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>        }</div>
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>        queue&lt;int&gt; children;</div>
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>        <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,root);</div>
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>        </div>
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>        <span class="keywordflow">while</span>(1){</div>
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>            <span class="keywordflow">if</span>(children.size()==0){</div>
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>                <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>            }</div>
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>            <span class="keywordflow">if</span>(v[children.front()].first_child!=-1){</div>
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>                <a class="code hl_function" href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">get_children</a>(children,children.front());</div>
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>            }</div>
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>            F(children.front()); </div>
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>            children.pop();</div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>        }</div>
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>        return ;</div>
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>    } </div>
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>}</div>
</div>
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span> </div>
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> Function&gt;</div>
<div class="foldopen" id="foldopen00495" data-start="{" data-end="}">
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"><a class="line" href="classmy__tree.html#a99d1637e88625af9f06b6d020730f634">  495</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__tree.html#a99d1637e88625af9f06b6d020730f634">my_tree&lt;T&gt;::traversal_binary_tree</a>(<span class="keywordtype">string</span> mode,Function F){</div>
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;first_root&quot;</span>){</div>
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>        <span class="keywordtype">int</span> root=<a class="code hl_function" href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">get_root</a>();</div>
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>        <a class="code hl_function" href="classmy__tree.html#aadec19d1d256df1f27412e80bd6579d1">traversal_binary_tree_with_root</a>(mode,root,F);</div>
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>        return ;</div>
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>    } </div>
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;last_root&quot;</span>){</div>
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>        <span class="keywordtype">int</span> root=<a class="code hl_function" href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">get_root</a>();</div>
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>        <a class="code hl_function" href="classmy__tree.html#aadec19d1d256df1f27412e80bd6579d1">traversal_binary_tree_with_root</a>(mode,root,F);        </div>
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>        return ;</div>
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>    } </div>
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;layer_first&quot;</span>){</div>
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>        <span class="keywordtype">int</span> root=<a class="code hl_function" href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">get_root</a>();</div>
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>        <a class="code hl_function" href="classmy__tree.html#aadec19d1d256df1f27412e80bd6579d1">traversal_binary_tree_with_root</a>(mode,root,F);</div>
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>        return ;</div>
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>    } </div>
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>}</div>
</div>
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span> </div>
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>ostream&amp; operator&lt;&lt;(ostream&amp; os,<a class="code hl_struct" href="struct_tree_node.html">TreeNode&lt;T&gt;</a> Node){</div>
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>    os&lt;&lt;Node.data&lt;&lt;<span class="charliteral">&#39; &#39;</span>&lt;&lt;Node.parent&lt;&lt;<span class="charliteral">&#39; &#39;</span>&lt;&lt;Node.first_child&lt;&lt;<span class="charliteral">&#39; &#39;</span>&lt;&lt;Node.next_sibling&lt;&lt;endl;</div>
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>    <span class="keywordflow">return</span> os;</div>
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>}</div>
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span> </div>
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00520" data-start="{" data-end="}">
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"><a class="line" href="classmy__tree.html#aa1da950e13ff2a3c6fcaca11015a4e20">  520</a></span>ostream&amp; <a class="code hl_friend" href="classmy__tree.html#aa1da950e13ff2a3c6fcaca11015a4e20">operator&lt;&lt;</a>(ostream&amp; os,<a class="code hl_function" href="classmy__tree.html#a9c79fe45a5aae4cbb2efbc5bb050a135">my_tree&lt;T&gt;</a> Tree){</div>
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>    <span class="keywordtype">int</span> nodes=Tree.<a class="code hl_function" href="classmy__tree.html#a826f12f2e9f55f7436fa8d3e1d41da93">get_nodes_nums</a>();</div>
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;nodes;i++){</div>
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>        os&lt;&lt;Tree.v[i];  </div>
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>    }</div>
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>    <span class="keywordflow">return</span> os;</div>
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>}</div>
</div>
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span> </div>
<div class="ttc" id="aclassmy__tree_html"><div class="ttname"><a href="classmy__tree.html">my_tree</a></div><div class="ttdoc">二叉树类（模板类，支持任意数据类型T）</div><div class="ttdef"><b>Definition</b> my_tree.h:77</div></div>
<div class="ttc" id="aclassmy__tree_html_a0020d5a85f5d99734466c6ef5d255b72"><div class="ttname"><a href="classmy__tree.html#a0020d5a85f5d99734466c6ef5d255b72">my_tree::show_binary_tree</a></div><div class="ttdeci">void show_binary_tree(string mode)</div><div class="ttdoc">遍历打印</div><div class="ttdef"><b>Definition</b> my_tree.h:426</div></div>
<div class="ttc" id="aclassmy__tree_html_a00b270f7f42b067702dadafc78f04bf6"><div class="ttname"><a href="classmy__tree.html#a00b270f7f42b067702dadafc78f04bf6">my_tree::show_k_node</a></div><div class="ttdeci">void show_k_node(int k)</div><div class="ttdoc">打印第k个</div><div class="ttdef"><b>Definition</b> my_tree.h:352</div></div>
<div class="ttc" id="aclassmy__tree_html_a0d6043fc3e177a775f837fc9dfaea31a"><div class="ttname"><a href="classmy__tree.html#a0d6043fc3e177a775f837fc9dfaea31a">my_tree::insert</a></div><div class="ttdeci">void insert(TreeNode&lt; T &gt; node)</div><div class="ttdoc">插入新节点</div><div class="ttdef"><b>Definition</b> my_tree.h:357</div></div>
<div class="ttc" id="aclassmy__tree_html_a2cef5c6b97d67ca6a49b0577600f5254"><div class="ttname"><a href="classmy__tree.html#a2cef5c6b97d67ca6a49b0577600f5254">my_tree::get_h_layer_nodes</a></div><div class="ttdeci">int get_h_layer_nodes(int h)</div><div class="ttdoc">得到h层的节点数</div><div class="ttdef"><b>Definition</b> my_tree.h:286</div></div>
<div class="ttc" id="aclassmy__tree_html_a3b2c0f604e05f25ffd37a6d0f45a2a26"><div class="ttname"><a href="classmy__tree.html#a3b2c0f604e05f25ffd37a6d0f45a2a26">my_tree::get_last_layer_nodes</a></div><div class="ttdeci">int get_last_layer_nodes()</div><div class="ttdoc">得到最后一层的节点数</div><div class="ttdef"><b>Definition</b> my_tree.h:334</div></div>
<div class="ttc" id="aclassmy__tree_html_a49e765fa53962f4ce7d11d6cdb8a12ad"><div class="ttname"><a href="classmy__tree.html#a49e765fa53962f4ce7d11d6cdb8a12ad">my_tree::show_binary_tree_with_root</a></div><div class="ttdeci">void show_binary_tree_with_root(string mode, int root)</div><div class="ttdoc">打印根和他的所有孩子</div><div class="ttdef"><b>Definition</b> my_tree.h:378</div></div>
<div class="ttc" id="aclassmy__tree_html_a532dfbc3d3835014944957a61b7a8bce"><div class="ttname"><a href="classmy__tree.html#a532dfbc3d3835014944957a61b7a8bce">my_tree::get_height</a></div><div class="ttdeci">int get_height(int index)</div><div class="ttdoc">得到树高</div><div class="ttdef"><b>Definition</b> my_tree.h:266</div></div>
<div class="ttc" id="aclassmy__tree_html_a6d1fb6a1cb4a9064cb2538d1fbaa8b06"><div class="ttname"><a href="classmy__tree.html#a6d1fb6a1cb4a9064cb2538d1fbaa8b06">my_tree::get_height</a></div><div class="ttdeci">int get_height()</div><div class="ttdoc">得到树高</div><div class="ttdef"><b>Definition</b> my_tree.h:280</div></div>
<div class="ttc" id="aclassmy__tree_html_a826f12f2e9f55f7436fa8d3e1d41da93"><div class="ttname"><a href="classmy__tree.html#a826f12f2e9f55f7436fa8d3e1d41da93">my_tree::get_nodes_nums</a></div><div class="ttdeci">int get_nodes_nums()</div><div class="ttdoc">树的总节点数</div><div class="ttdef"><b>Definition</b> my_tree.h:340</div></div>
<div class="ttc" id="aclassmy__tree_html_a908b1d95027e3afb39e7e33b59de10b9"><div class="ttname"><a href="classmy__tree.html#a908b1d95027e3afb39e7e33b59de10b9">my_tree::operator[]</a></div><div class="ttdeci">T operator[](int index)</div><div class="ttdoc">操作符重载[]</div><div class="ttdef"><b>Definition</b> my_tree.h:198</div></div>
<div class="ttc" id="aclassmy__tree_html_a99d1637e88625af9f06b6d020730f634"><div class="ttname"><a href="classmy__tree.html#a99d1637e88625af9f06b6d020730f634">my_tree::traversal_binary_tree</a></div><div class="ttdeci">void traversal_binary_tree(string mode, Function F)</div><div class="ttdoc">遍历打印</div><div class="ttdef"><b>Definition</b> my_tree.h:495</div></div>
<div class="ttc" id="aclassmy__tree_html_a9aa06543930fa8ddb21c1ebabbff3ecf"><div class="ttname"><a href="classmy__tree.html#a9aa06543930fa8ddb21c1ebabbff3ecf">my_tree::print_node</a></div><div class="ttdeci">friend void print_node(my_tree&lt; T &gt; Tree, int x)</div><div class="ttdoc">打印节点，后续用来bind之后传入traversal</div><div class="ttdef"><b>Definition</b> my_tree.h:35</div></div>
<div class="ttc" id="aclassmy__tree_html_a9c79fe45a5aae4cbb2efbc5bb050a135"><div class="ttname"><a href="classmy__tree.html#a9c79fe45a5aae4cbb2efbc5bb050a135">my_tree::my_tree</a></div><div class="ttdeci">my_tree(T val=0)</div><div class="ttdoc">构造函数</div><div class="ttdef"><b>Definition</b> my_tree.h:87</div></div>
<div class="ttc" id="aclassmy__tree_html_aa1da950e13ff2a3c6fcaca11015a4e20"><div class="ttname"><a href="classmy__tree.html#aa1da950e13ff2a3c6fcaca11015a4e20">my_tree::operator&lt;&lt;</a></div><div class="ttdeci">friend ostream &amp; operator&lt;&lt;(ostream &amp;os, my_tree&lt; T &gt; Tree)</div><div class="ttdoc">操作符重载&lt;&lt;</div><div class="ttdef"><b>Definition</b> my_tree.h:520</div></div>
<div class="ttc" id="aclassmy__tree_html_aadec19d1d256df1f27412e80bd6579d1"><div class="ttname"><a href="classmy__tree.html#aadec19d1d256df1f27412e80bd6579d1">my_tree::traversal_binary_tree_with_root</a></div><div class="ttdeci">void traversal_binary_tree_with_root(string mode, int root, Function F)</div><div class="ttdoc">打印根和他的所有孩子</div><div class="ttdef"><b>Definition</b> my_tree.h:446</div></div>
<div class="ttc" id="aclassmy__tree_html_ab1c9be9f0c6b3fee4b3322841014b8a3"><div class="ttname"><a href="classmy__tree.html#ab1c9be9f0c6b3fee4b3322841014b8a3">my_tree::get_root</a></div><div class="ttdeci">int get_root()</div><div class="ttdoc">树的根的编号</div><div class="ttdef"><b>Definition</b> my_tree.h:224</div></div>
<div class="ttc" id="aclassmy__tree_html_af25baab5cde301d7087d8c5f63727a8f"><div class="ttname"><a href="classmy__tree.html#af25baab5cde301d7087d8c5f63727a8f">my_tree::get_children</a></div><div class="ttdeci">void get_children(vector&lt; int &gt; &amp;children, int root)</div><div class="ttdoc">把某个节点对应的直接的孩子们压入向量中</div><div class="ttdef"><b>Definition</b> my_tree.h:234</div></div>
<div class="ttc" id="aclassmy__tree_html_afbfe59f624cf7f8a7f8ebb3cc9ad4514"><div class="ttname"><a href="classmy__tree.html#afbfe59f624cf7f8a7f8ebb3cc9ad4514">my_tree::get_value</a></div><div class="ttdeci">T get_value()</div><div class="ttdoc">打印根节点值</div><div class="ttdef"><b>Definition</b> my_tree.h:345</div></div>
<div class="ttc" id="astruct_tree_node_html"><div class="ttname"><a href="struct_tree_node.html">TreeNode</a></div><div class="ttdoc">节点结构结构体（模板类，支持任意数据类型T）</div><div class="ttdef"><b>Definition</b> my_tree.h:50</div></div>
<div class="ttc" id="astruct_tree_node_html_a04c315e7d9af382fa471a9d3858e8c72"><div class="ttname"><a href="struct_tree_node.html#a04c315e7d9af382fa471a9d3858e8c72">TreeNode::TreeNode</a></div><div class="ttdeci">TreeNode(T d=T(), int p=-1, int fc=-1, int ns=-1)</div><div class="ttdoc">构造函数</div><div class="ttdef"><b>Definition</b> my_tree.h:64</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><b>my_tree.h</b></li>
    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
  </ul>
</div>
</body>
</html>
